Task Instance Classification via Graph Kernels
نویسندگان
چکیده
Knowledge-intensive work plays an increasingly important role in organisations of all types. Knowledge workers contribute their effort to achieve a common purpose; they are part of (business) processes. Workflow Management Systems support them during their daily work, featuring guidance and providing intelligent resource delivery. However, the emergence of richly structured, heterogeneous datasets requires a reassessment of existing mining techniques which do not take possible relations between individual instances into account. Neglecting these relations might lead to inappropriate conclusions about the data. In order to uphold the support quality of knowledge workers, the application of mining methods, that consider structure information rather than content information, is necessary. In the scope of the research project DYONIPOS, user interaction patterns, e.g., relations between users, resources and tasks, are mapped in the form of graphs. We utilize graph kernels to exploit structural information and apply Support Vector Machines to classify task instances to task models.
منابع مشابه
A Fast Approximation of the Weisfeiler-Lehman Graph Kernel for RDF Data
We introduce an approximation of the Weisfeiler-Lehman graph kernel algorithm aimed at improving the computation time of the kernel when applied to Resource Description Framework (RDF) data. RDF is the representation/storarge format of the semantic web and it essentially represents a graph. One direction for learning from the semantic web is using graph kernel methods on RDF. This is a very gen...
متن کاملAn Experimental Investigation of Graph Kernels on Collaborative Recommendation and Semisupervised Classification
This paper presents a survey as well as a systematic empirical comparison of seven graph kernels and two related similarity matrices (simply referred to as graph kernels), namely the exponential diffusion kernel, the Laplacian exponential diffusion kernel, the von Neumann diffusion kernel, the regularized Laplacian kernel, the commute-time kernel, the random-walk-with-restart similarity matrix,...
متن کاملGraph Classification via Topological and Label Attributes
Graph classification is an important data mining task, and various graph kernel methods have been proposed recently for this task. These methods have proven to be effective, but they tend to have high computational overhead. In this paper, we propose an alternative approach to graph classification that is based on feature-vectors constructed from different global topological attributes, as well...
متن کاملLossy Kernels for Graph Contraction Problems
We study some well-known graph contraction problems in the recently introduced framework of lossy kernelization. In classical kernelization, given an instance (I, k) of a parameterized problem, we are interested in obtaining (in polynomial time) an equivalent instance (I ′, k′) of the same problem whose size is bounded by a function in k. This notion however has a major limitation. Given an app...
متن کاملgraph2vec: Learning Distributed Representations of Graphs
Recent works on representation learning for graph structured data predominantly focus on learning distributed representations of graph substructures such as nodes and subgraphs. However, many graph analytics tasks such as graph classification and clustering require representing entire graphs as fixed length feature vectors. While the aforementioned approaches are naturally unequipped to learn s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007